The size of minimum 3-trees: Cases 3 and 4 mod 6
نویسندگان
چکیده
A 3-uniform hypergraph is called a minimum 3-tree if for any 3-coloring of its vertex set there is a heterochromatic edge and the hypergraph has the minimum possible numberof edges. Here we s h o w that the numberof edges in such 3-tree is l n(n;2) 3 m for any n umberof vertices n 3 4 (mod 6):
منابع مشابه
The size of minimum 3-trees: cases 0 and 1 mod 12
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of triples. There is a conjecture that the number of triples in such 3-tree is dn(n−2) 3 e for any number of vertices n. Here we give a proof of this conjecture for any n ≡ 0, 1mod 12.
متن کاملOn the largest k th eigenvalues of trees with n ≡ 0 ( mod k ) ø
We consider the only remaining unsolved case n ≡ 0 (mod k) for the largest kth eigenvalue of trees with n vertices. In 1995, Jia-yu Shao gave complete solutions for the cases k = 2, 3, 4, 5, 6 and provided some necessary conditions for extremal trees in general cases (cf. [Linear Algebra Appl. 221 (1995) 131]). We further improve Shao’s necessary condition in this paper, which can be seen as th...
متن کاملOn non-z(mod k) dominating sets
For a graph G, a positive integer k, k ≥ 2, and a non-negative integer with z < k and z 6= 1, a subset D of the vertex set V (G) is said to be a non-z (mod k) dominating set if D is a dominating set and for all x ∈ V (G), |N [x] ∩ D| 6≡ z (mod k). For the case k = 2 and z = 0, it has been shown that these sets exist for all graphs. The problem for k ≥ 3 is unknown (the existence for even values...
متن کاملFurther results on the existence of generalized Steiner triple systems with group size g≡1, 5(mod 6)
Generalized Steiner triple systems, GS(2, 3, n, g) are equivalent to maximum constant weight codes over an alphabet of size g + 1 with distance 3 and weight 3 in which each codeword has length n. The necessary conditions for the existence of a GS(2, 3, n, g) are (n − 1)g ≡ 0 (mod 2), n(n − 1)g ≡ 0 (mod 6), and n ≥ g + 2. Recently, we proved that for any given g, g ≡ 1, 5 (mod 6) and g ≥ 11, if ...
متن کاملThe generalized connectivity of complete equipartition 3-partite graphs
Let G be a nontrivial connected graph of order n, and k an integer with 2 ≤ k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number ` of edge-disjoint trees T1, T2, . . . , T` in G such that V (Ti) ∩ V (Tj) = S for every pair of distinct integers i, j with 1 ≤ i, j ≤ `. Chartrand et al. generalized the concept of connectivity as follows: The kconnectivity of G, denoted by κk(G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 1999